#
# @lc app=leetcode.cn id=35 lang=python
#
# [35] 搜索插入位置
#
# https://leetcode-cn.com/problems/search-insert-position/description/
#
# algorithms
# Easy (47.00%)
# Likes:    810
# Dislikes: 0
# Total Accepted:    314.3K
# Total Submissions: 668.8K
# Testcase Example:  '[1,3,5,6]\n5'
#
# 给定一个排序数组和一个目标值，在数组中找到目标值，并返回其索引。如果目标值不存在于数组中，返回它将会被按顺序插入的位置。
# 
# 你可以假设数组中无重复元素。
# 
# 示例 1:
# 
# 输入: [1,3,5,6], 5
# 输出: 2
# 
# 
# 示例 2:
# 
# 输入: [1,3,5,6], 2
# 输出: 1
# 
# 
# 示例 3:
# 
# 输入: [1,3,5,6], 7
# 输出: 4
# 
# 
# 示例 4:
# 
# 输入: [1,3,5,6], 0
# 输出: 0
# 
# 
#

# @lc code=start
class Solution(object):
    def searchInsert(self, A, target):
        """
        :type A: List[int]
        :type target: int
        :rtype: int
        """
        if not A or len(A) == 0:
            return 0
        
        l = 0
        r = len(A)

        while l < r:
            m = l + ((r-l)>>1)
            if (A[m] < target):
                l = m + 1
            else:
                r = m
        
        return l
# @lc code=end

